Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
661	Polymorphic Time Systems for Estimating Program Complexity Vincent Dornic 1 2 ; Pierre Jouvelot 1 3 Add to Reading List Source URL: www.psrg.csail.mit.edu Language: English - Date: 2013-07-14 14:56:24 Type theory Data types Theoretical computer science Lambda calculus Formal methods Type system Programming language Fixed-point combinator Recursive data type Software engineering Computing Programming language theory
662	Scalable Multi-class Object Detection Nima Razavi1 Juergen Gall1 1 ETH Zurich, Switzerland Add to Reading List Source URL: www.vision.ee.ethz.ch Language: English - Date: 2011-07-26 10:11:57 Vision Imaging Hough transform K-nearest neighbor algorithm Constellation model Computational complexity theory Segmentation Time complexity Bag of words model in computer vision Image processing Artificial intelligence Computer vision
663	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
664	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 NP-complete problems Probabilistic complexity theory Mathematical optimization Complexity classes PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
665	Chapter 5: Random Sampling and Randomized Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter 5) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:15:06 NP-complete problems Combinatorial optimization Analysis of algorithms Logic in computer science Time complexity Boolean satisfiability problem Randomized algorithm Algorithm Maximum satisfiability problem Theoretical computer science Applied mathematics Computational complexity theory
666	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Spanning tree Operations research Travelling salesman problem Approximation algorithm Time complexity NP-complete Algorithm Minimum spanning tree Theoretical computer science Computational complexity theory Applied mathematics
667	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
668	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
669	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
670	Numerical Reproducibility and Accuracy at ExaScale (Invited Paper) James Demmel Mathematics Department and CS Division University of California at Berkeley Berkeley, CA 94720 Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2013-05-09 15:03:12 Applied mathematics Kahan summation algorithm Floating point Algorithm Rounding Summation Machine epsilon Time complexity Pairwise summation Computer arithmetic Theoretical computer science Mathematics

UPDATE